Parallel Quasi-Monte Carlo Computation of Invariant Measures

نویسندگان

  • Jiu Ding
  • Marcin Paprzycki
  • Benjamin Seyfarth
  • Zizhong Wang
چکیده

where m is the Lebesgue measure of R, has a fixed density f∗. This fixed density gives rise to a physical measure of S, which describes the asymptotic behavior of the chaotic orbits from the statistical viewpoint [3]. Our purpose is efficient computation of such fixed densities. In his book [6], Ulam proposed a piecewise constant approximation method to calculate the fixed density f∗ and conjectured that the resulting piecewise constant densities fn would converge to f ∗. In 1976, Li [4] proved the conjecture for the Lasota-Yorke class of piecewise C and stretching mappings S : [0, 1] → [0, 1]. Since Li’s pioneering work, Ulam’s method has been widely investigated concerning its convergence for various classes of transformations and its error estimates. See, e.g., [5] and the references therein. Although Ulam’s method is practically convergent for almost all the problems encountered so far, it has a shortage, especially for high dimensional transformations. That is, the exact numerical evaluation of a matrix in Ulam’s method be-

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Monte Carlo in the Parallel Computation of Invariant Measures

For a non-singular multi-dimensional mapping S: X Æ X, the corresponding FrobeniusPerron operator is P. In the paper, the schemes for generating the quasi-random numbers are studied for the parallel computation for the fixed density of P. The numerical results for these schemes are presented.

متن کامل

v 1 3 O ct 1 99 6 Parallel computation using generalized models of exactly solvable chaos 1 Ken

How chaos is useful in the brain information processing is greatly unknown. Here, we show that the statistical property of chaos such as invariant measures naturally organized under a great number of iterations of chaotic mappings can be used for some complex computations, while the precise information of initial conditions which vanishes in the course of iterations deos not matter for this kin...

متن کامل

Application of Quasi Monte Carlo Integra- Tion Technique in Efficient Capacitance Computation

A new integration technique based on use of Quasi Monte Carlo Integration (QMCI) technique is proposed for Method of Moments (MoM) solution of Integral equation for capacitance computation. The integral equation for unknown charge distribution over the capacitors is formulated. The solutions are obtained by MoM using the QMCI technique. It is observed that the proposed method is not only capabl...

متن کامل

Reliability and Sensitivity Analysis of Structures Using Adaptive Neuro-Fuzzy Systems

In this study, an efficient method based on Monte Carlo simulation, utilized with Adaptive Neuro-Fuzzy Inference System (ANFIS) is introduced for reliability analysis of structures. Monte Carlo Simulation is capable of solving a broad range of reliability problems. However, the amount of computational efforts that may involve is a draw back of such methods. ANFIS is capable of approximating str...

متن کامل

Parallel Computation of Multivariate Normal Probabilities

We present methods for the computation of multivari-ate normal probabilities on parallel/ distributed systems. After a transformation of the initial integral, an approximation can be obtained using Monte-Carlo or quasi-random methods. We propose a meta-algorithm for asynchronous sampling methods and derive eecient parallel algorithms for the computation of MVN distribution functions, including ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001